A Greedy Algorithm for Minimizing a Separable Convex Function over an Integral Bisubmodular Polyhedron
نویسندگان
چکیده
We present a new greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron. The algorithm starts with a.n arbitrary feasible solution and a current feasible solution incrementally moves toward an optimal one in a greedy way. \Ve also show that there exists at least one optimal solution in the coordinate-wise steepest descent direction from a feasible solution if it is not an optimal one.
منابع مشابه
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra1
The concept of neighbor system, introduced by Hartvigsen (2010), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship of neighbor systems with jump systems and with bisubmodular polyhedra. We firstly prove that for every neighbor system, there exists a jump system which has the same neighborhood structure as the original neighbor sy...
متن کاملNeighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship of neighbor systems with jump systems and with bisubmodular polyhedra. We firstly prove that for every neighbor system, there exists a jump system which has the same neighborhood structure as the original neighbor sy...
متن کاملNeighbor Systems and the Greedy Algorithm ( Extended
A neighbor system, introduced in this paper, is a collection of integral vectors in R with some special structure. Such collections (slightly) generalize jump systems, which, in turn, generalize integral bisubmodular polyhedra, integral polymatroids, delta-matroids, matroids, and other structures. We show that neighbor systems provide a systematic and simple way to characterize these structures...
متن کاملDelta-Matroids, Jump Systems, and Bisubmodular Polyhedra
We relate an axiomatic generalization of matroids, called a jump system, to poly-hedra arising from bisubmodular functions. Unlike the case for usual submodularity, the points of interest are not all the integral points in the relevant polyhedron, but form a subset of them. However, we do show that the convex hull of the set of points of a jump system is a bisubmodular polyhedron, and that the ...
متن کاملBisubmodular polyhedra, simplicial divisions, and discrete convexity
We consider a class of integer-valued discrete convex functions, called BS-convex functions, defined on integer lattices whose affinity domains are sets of integral points of integral bisubmodular polyhedra. We examine discrete structures of BSconvex functions and give a characterization of BS-convex functions in terms of their convex conjugate functions by means of (discordant) Freudenthal sim...
متن کامل